通常假设基于深神经网络的分类器的培训和测试数据是从相同的分布采样的。当从远离训练样品的分布中抽出部分测试样品时（AKA分配（OOD）样本），培训的神经网络具有对这些ood的高信任预测的趋势样品。当培训用于图像分类的神经网络，对象检测等的神经网络时，检测是至关重要的。它可以提高分类器对无关投入的鲁棒性，并在不同形式的攻击下提高系统恢复力和安全性。检测OOD样品有三个主要挑战：（i）建议的OOD检测方法应与各种分类器的各种架构（例如，DENSENET，RESET）兼容，而不会显着提高模型复杂性和对计算资源的要求; （ii）ood样本可能来自多个分布，其类标签通常不可用; （iii）需要定义得分函数以有效地分离来自分布（IND）样本的OOD样本。为了克服这些挑战，我们提出了一种基于Wasserstein的分布式检测（木材）方法。基本思想是定义基于Wassersein-距离的评分，评估测试样品与IND样品的分布之间的异化。然后基于所提出的得分函数制定和解决优化问题。研究了所提出的方法的统计学习，以保证经验优化器实现的损耗值近似于全局最优。比较研究结果表明，所提出的木材始终如一地优于其他现有的ood检测方法。

精神分裂症（SZ）是一种精神障碍，由于大脑中特定化学品的分泌，一些脑区的功能失去平衡，导致思想，行动和情绪之间缺乏协调。本研究提供了通过脑电图（EEG）信号的自动化SZ诊断的各种智能深度学习（DL）方法。将得到的结果与传统智能方法的结果进行比较。为了实施拟议的方法，已经使用了波兰华沙精神病学与神经学研究所的数据集。首先，将EEG信号分成25秒的时间框架，然后通过Z分数或标准L2标准化。在分类步骤中，考虑通过EEG信号考虑两种不同的方法进行SZ诊断。在该步骤中，首先通过传统的机器学习方法进行EEG信号的分类，例如，支持向量机，K-CORMONT邻居，决策树，NA \“IVE贝叶斯，随机森林，极其随机树木和袋装。各种提出的DL模型，即长的短期存储器（LSTMS），一维卷积网络（1D-CNNS）和1D-CNN-LSTMS。在此步骤中，实现并比较了DL模型具有不同的激活功能。在提议的DL模型中，CNN-LSTM架构具有最佳性能。在这种架构中，使用具有Z分数和L2组合标准化的Relu激活功能。所提出的CNN-LSTM模型具有达到99.25％的准确度，比该领域的大多数前研究的结果更好。值得一提的是，为了执行所有模拟，已经使用了具有k = 5的k折叠交叉验证方法。

由于癫痫发生是由于大脑的异常活性引起的，因此癫痫发作会影响您的大脑处理的任何过程。癫痫发作的一些体征和症状包括混乱，异常凝视以及快速，突然和无法控制的手动运动。癫痫发作检测方法涉及神经检查，血液检查，神经心理学检查和神经影像学方法。其中，神经影像学的方式受到了专业医生的极大关注。一种促进癫痫发作准确，快速诊断的方法是基于深度学习（DL）和神经成像方式采用计算机辅助诊断系统（CADS）。本文研究了利用神经影像学方式利用用于癫痫发作检测和预测的DL方法的全面概述。首先，讨论了用于使用神经影像模式的癫痫发作检测和预测的基于DL的CAD。此外，还包括了用于癫痫发作检测和预测的各种数据集的描述，预处理算法和DL模型。然后，已经介绍了有关康复工具的研究，其中包含脑部计算机接口（BCI），可植入，云计算，物联网（IoT），在现场可编程栅极阵列（FPGA）上的DL技术实现，等等。讨论部分是关于癫痫发作检测和预测研究之间的比较。使用神经影像模式和DL模型的癫痫发作检测和预测中最重要的挑战。此外，已经提出了数据集，DL，康复和硬件模型领域的未来工作建议。最后一部分致力于结论，并在该领域结合了最重要的发现。

准确诊断自闭症谱系障碍（ASD），随后有效康复对该疾病的管理至关重要。人工智能（AI）技术可以帮助医生应用自动诊断和康复程序。 AI技术包括传统机器学习（ML）方法和深度学习（DL）技术。常规ML方法采用各种特征提取和分类技术，但在DL中，特征提取和分类过程是智能的，一体地完成的。诊断ASD的DL方法已经专注于基于神经影像动物的方法。神经成像技术是无侵入性疾病标志物，可能对ASD诊断有用。结构和功能神经影像技术提供了关于大脑的结构（解剖结构和结构连接）和功能（活性和功能连接）的实质性信息。由于大脑的复杂结构和功能，提出了在不利用像DL这样的强大AI技术的情况下使用神经影像数据进行ASD诊断的最佳程序可能是具有挑战性的。本文研究了借助DL网络进行以区分ASD进行的研究。还评估了用于支持ASD患者的康复工具，用于利用DL网络的支持患者。最后，我们将在ASD的自动检测和康复中提出重要挑战，并提出了一些未来的作品。

Consensus clustering aggregates partitions in order to find a better fit by reconciling clustering results from different sources/executions. In practice, there exist noise and outliers in clustering task, which, however, may significantly degrade the performance. To address this issue, we propose a novel algorithm -- robust consensus clustering that can find common ground truth among experts' opinions, which tends to be minimally affected by the bias caused by the outliers. In particular, we formalize the robust consensus clustering problem as a constraint optimization problem, and then derive an effective algorithm upon alternating direction method of multipliers (ADMM) with rigorous convergence guarantee. Our method outperforms the baselines on benchmarks. We apply the proposed method to the real-world advertising campaign segmentation and forecasting tasks using the proposed consensus clustering results based on the similarity computed via Kolmogorov-Smirnov Statistics. The accurate clustering result is helpful for building the advertiser profiles so as to perform the forecasting.

In computational advertising, a challenging problem is how to recommend the bid for advertisers to achieve the best return on investment (ROI) given budget constraint. This paper presents a bid recommendation scenario that discovers the concavity changes in click prediction curves. The recommended bid is derived based on the turning point from significant increase (i.e. concave downward) to slow increase (convex upward). Parametric learning based method is applied by solving the corresponding constraint optimization problem. Empirical studies on real-world advertising scenarios clearly demonstrate the performance gains for business metrics (including revenue increase, click increase and advertiser ROI increase).

In cost-per-click (CPC) or cost-per-impression (CPM) advertising campaigns, advertisers always run the risk of spending the budget without getting enough conversions. Moreover, the bidding on advertising inventory has few connections with propensity one that can reach to target cost-per-acquisition (tCPA) goals. To address this problem, this paper presents a bid optimization scenario to achieve the desired tCPA goals for advertisers. In particular, we build the optimization engine to make a decision by solving the rigorously formalized constrained optimization problem, which leverages the bid landscape model learned from rich historical auction data using non-parametric learning. The proposed model can naturally recommend the bid that meets the advertisers' expectations by making inference over advertisers' historical auction behaviors, which essentially deals with the data challenges commonly faced by bid landscape modeling: incomplete logs in auctions, and uncertainty due to the variation and fluctuations in advertising bidding behaviors. The bid optimization model outperforms the baseline methods on real-world campaigns, and has been applied into a wide range of scenarios for performance improvement and revenue liftup.

We propose a new neural network design paradigm Reversible Column Network (RevCol). The main body of RevCol is composed of multiple copies of subnetworks, named columns respectively, between which multi-level reversible connections are employed. Such architectural scheme attributes RevCol very different behavior from conventional networks: during forward propagation, features in RevCol are learned to be gradually disentangled when passing through each column, whose total information is maintained rather than compressed or discarded as other network does. Our experiments suggest that CNN-style RevCol models can achieve very competitive performances on multiple computer vision tasks such as image classification, object detection and semantic segmentation, especially with large parameter budget and large dataset. For example, after ImageNet-22K pre-training, RevCol-XL obtains 88.2% ImageNet-1K accuracy. Given more pre-training data, our largest model RevCol-H reaches 90.0% on ImageNet-1K, 63.8% APbox on COCO detection minival set, 61.0% mIoU on ADE20k segmentation. To our knowledge, it is the best COCO detection and ADE20k segmentation result among pure (static) CNN models. Moreover, as a general macro architecture fashion, RevCol can also be introduced into transformers or other neural networks, which is demonstrated to improve the performances in both computer vision and NLP tasks. We release code and models at https://github.com/megvii-research/RevCol

We address the theoretical and practical problems related to the trajectory generation and tracking control of tail-sitter UAVs. Theoretically, we focus on the differential flatness property with full exploitation of actual UAV aerodynamic models, which lays a foundation for generating dynamically feasible trajectory and achieving high-performance tracking control. We have found that a tail-sitter is differentially flat with accurate aerodynamic models within the entire flight envelope, by specifying coordinate flight condition and choosing the vehicle position as the flat output. This fundamental property allows us to fully exploit the high-fidelity aerodynamic models in the trajectory planning and tracking control to achieve accurate tail-sitter flights. Particularly, an optimization-based trajectory planner for tail-sitters is proposed to design high-quality, smooth trajectories with consideration of kinodynamic constraints, singularity-free constraints and actuator saturation. The planned trajectory of flat output is transformed to state trajectory in real-time with consideration of wind in environments. To track the state trajectory, a global, singularity-free, and minimally-parameterized on-manifold MPC is developed, which fully leverages the accurate aerodynamic model to achieve high-accuracy trajectory tracking within the whole flight envelope. The effectiveness of the proposed framework is demonstrated through extensive real-world experiments in both indoor and outdoor field tests, including agile SE(3) flight through consecutive narrow windows requiring specific attitude and with speed up to 10m/s, typical tail-sitter maneuvers (transition, level flight and loiter) with speed up to 20m/s, and extremely aggressive aerobatic maneuvers (Wingover, Loop, Vertical Eight and Cuban Eight) with acceleration up to 2.5g.

Traditional multilingual neural machine translation (MNMT) uses a single model to translate all directions. However, with the increasing scale of language pairs, simply using a single model for massive MNMT brings new challenges: parameter tension and large computations. In this paper, we revisit multi-way structures by assigning an individual branch for each language (group). Despite being a simple architecture, it is challenging to train de-centralized models due to the lack of constraints to align representations from all languages. We propose a localized training recipe to map different branches into a unified space, resulting in an efficient detachable model, Lego-MT. For a fair comparison, we collect data from OPUS and build the first large-scale open-source translation benchmark covering 7 language-centric data, each containing 445 language pairs. Experiments show that Lego-MT (1.2B) brings gains of more than 4 BLEU while outperforming M2M-100 (12B) (We will public all training data, models, and checkpoints)